Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Loss network")

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 10 of 10

  • Page / 1
Export

Selection :

  • and

A class of interacting marked point processes: Rate of convergence to equilibriumTORRISI, G. L.Journal of applied probability. 2002, Vol 39, Num 1, pp 137-160, issn 0021-9002Article

A heavy traffic limit theorem for a class of open queueing networks with finite buffersDAI, J. G; DAI, W.Queueing systems. 1999, Vol 32, Num 1-3, pp 5-40, issn 0257-0130Article

ASYMPTOTIC BLOCKING PROBABILITIES IN LOSS NETWORKS WITH SUBEXPONENTIAL DEMANDSYINGDONG LU; RADOVANOVIC, Ana.Journal of applied probability. 2007, Vol 44, Num 4, pp 1088-1102, issn 0021-9002, 15 p.Article

Dynamics of large uncontrolled loss networksZACHARY, Stan.Journal of applied probability. 2000, Vol 37, Num 3, pp 685-695, issn 0021-9002Article

Bandwidth allocation for a revenue-aware network utility maximizationMAYER, David; BARRIA, Javier A.IEEE communications letters. 2007, Vol 11, Num 7, pp 634-636, issn 1089-7798, 3 p.Article

Throughput gains imparted by slotting on a blocking line mediumCAMPELO, Divanilson R; WALDMAN, Helio.IEEE communications letters. 2006, Vol 10, Num 3, pp 201-203, issn 1089-7798, 3 p.Article

Bounds and policies for dynamic routing in loss networksBERTSIMAS, D; CHRYSSIKOU, T.Operations research. 1999, Vol 47, Num 3, pp 379-394, issn 0030-364XArticle

A new method for approximating blocking probability in overflow loss networksWONG, Eric W. M; ZALESKY, Andrew; ROSBERG, Zvi et al.Computer networks (1999). 2007, Vol 51, Num 11, pp 2958-2975, issn 1389-1286, 18 p.Article

Shortest path and maximum flow problems in networks with additive losses and gainsBRANDENBURG, Franz J; CAI, Mao-Cheng.Theoretical computer science. 2011, Vol 412, Num 4-5, pp 391-401, issn 0304-3975, 11 p.Article

Analyzing product-form stochastic networks via factor graphs and the sum-product algorithmJIAN NI; TATIKONDA, Sekhar.IEEE transactions on communications. 2007, Vol 55, Num 8, pp 1588-1597, issn 0090-6778, 10 p.Article

  • Page / 1